Recognition of micro-scale deformation structures in glacial sediments - pattern perception, observer bias and the influence of experience

It is a scientist's mission to try to remain unbiased. However, certain factors play a role in scientific analyses that are not controlled by conscious thought. These factors are potentially very important in areas of science where interpretations are based on a scientist's ability to identify patterns or structures. One such area is the micromorphology of glacial sediments. In this paper we investigate the role of an analyst's experience in relation to pattern perception with specific reference to turbate microstructures in glacial diamictons. An experiment was conducted on 52 participants, which demonstrated that, as may be expected, more experienced (glacial) micromorphologists tend to exhibit a higher sensitivity-to-signal, but that complete novices, if given clear instructions, can reach levels of sensitivity similar to those of experts. It also showed, perhaps more surprisingly, that response bias does not decrease with experience. We discuss psychological factors, such as the drive for success and consistency, that may have contributed to these results and investigate their possible implications in the micromorphological analysis and interpretation of glacial sediments

Prediction of far-field acoustic emissions from cavitation clouds during shock wave lithotripsy for development of a clinical device

This study presents the key simulation and decision stage of a multi-disciplinary project to develop a hospital device for monitoring the effectiveness of kidney stone fragmentation by shock wave lithotripsy (SWL). The device analyses, in real time, the pressure fields detected by sensors placed on the patient's torso, fields generated by the interaction of the incident shock wave, cavitation, kidney stone and soft tissue. Earlier free-Lagrange simulations of those interactions were restricted (by limited computational resources) to computational domains within a few centimetres of the stone. Later studies estimated the far-field pressures generated when those interactions involved only single bubbles. This study extends the free-Lagrange method to quantify the bubble–bubble interaction as a function of their separation. This, in turn, allowed identification of the validity of using a model of non-interacting bubbles to obtain estimations of the far-field pressures from 1000 bubbles distributed within the focus of the SWL field. Up to this point in the multi-disciplinary project, the design of the clinical device had been led by the simulations. This study records the decision point when the project's direction had to be led by far more costly clinical trials instead of the relatively inexpensive simulations. <br/

Parallel Exhaustive Search without Coordination

We analyze parallel algorithms in the context of exhaustive search over totally ordered sets. Imagine an infinite list of "boxes", with a "treasure" hidden in one of them, where the boxes' order reflects the importance of finding the treasure in a given box. At each time step, a search protocol executed by a searcher has the ability to peek into one box, and see whether the treasure is present or not. By equally dividing the workload between them, $k$ searchers can find the treasure $k$ times faster than one searcher. However, this straightforward strategy is very sensitive to failures (e.g., crashes of processors), and overcoming this issue seems to require a large amount of communication. We therefore address the question of designing parallel search algorithms maximizing their speed-up and maintaining high levels of robustness, while minimizing the amount of resources for coordination. Based on the observation that algorithms that avoid communication are inherently robust, we analyze the best running time performance of non-coordinating algorithms. Specifically, we devise non-coordinating algorithms that achieve a speed-up of $9/8$ for two searchers, a speed-up of $4/3$ for three searchers, and in general, a speed-up of $\frac{k}{4}(1+1/k)^2$ for any $k\geq 1$ searchers. Thus, asymptotically, the speed-up is only four times worse compared to the case of full-coordination, and our algorithms are surprisingly simple and hence applicable. Moreover, these bounds are tight in a strong sense as no non-coordinating search algorithm can achieve better speed-ups. Overall, we highlight that, in faulty contexts in which coordination between the searchers is technically difficult to implement, intrusive with respect to privacy, and/or costly in term of resources, it might well be worth giving up on coordination, and simply run our non-coordinating exhaustive search algorithms

Binary Oscillatory Crossflow Electrophoresis

Electrophoresis has long been recognized as an effective analytic technique for the separation of proteins and other charged species, however attempts at scaling up to accommodate commercial volumes have met with limited success. In this report we describe a novel electrophoretic separation technique - Binary Oscillatory Crossflow Electrophoresis (BOCE). Numerical simulations indicate that the technique has the potential for preparative scale throughputs with high resolution, while simultaneously avoiding many problems common to conventional electrophoresis. The technique utilizes the interaction of an oscillatory electric field and a transverse oscillatory shear flow to create an active binary filter for the separation of charged protein species. An oscillatory electric field is applied across the narrow gap of a rectangular channel inducing a periodic motion of charged protein species. The amplitude of this motion depends on the dimensionless electrophoretic mobility, alpha = E(sub o)mu/(omega)d, where E(sub o) is the amplitude of the electric field oscillations, mu is the dimensional mobility, omega is the angular frequency of oscillation and d is the channel gap width. An oscillatory shear flow is induced along the length of the channel resulting in the separation of species with different mobilities. We present a model that predicts the oscillatory behavior of charged species and allows estimation of both the magnitude of the induced convective velocity and the effective diffusivity as a function of a in infinitely long channels. Numerical results indicate that in addition to the mobility dependence, the steady state behavior of solute species may be strongly affected by oscillating fluid into and out of the active electric field region at the ends of the cell. The effect is most pronounced using time dependent shear flows of the same frequency (cos((omega)t)) flow mode) as the electric field oscillations. Under such conditions, experiments indicate that solute is drawn into the cell from reservoirs at both ends of the cell leading to a large mass build up. As a consequence, any initially induced mass flux will vanish after short times. This effect was not captured by the infinite channel model and hence numerical and experimental results deviated significantly. The revised model including finite cell lengths and reservoir volumes allowed quantitative predictions of the time history of the concentration profile throughout the system. This latter model accurately describes the fluxes observed for both oscillatory flow modes in experiments using single protein species. Based on the results obtained from research funded under NASA grant NAG-8-1080.S, we conclude that binary separations are not possible using purely oscillatory flow modes because of end effects associated with the cos((omega)t) mode. Our research shows, however, that a combination of cos(2(omega)t) and steady flow should lead to efficient separation free of end effects. This possibility is currently under investigation

Annual report African Studies Centre Leiden 2021

bookASC – Publicaties niet-programma gebonde

On the Number of Iterations for Dantzig-Wolfe Optimization and Packing-Covering Approximation Algorithms

We give a lower bound on the iteration complexity of a natural class of Lagrangean-relaxation algorithms for approximately solving packing/covering linear programs. We show that, given an input with $m$ random 0/1-constraints on $n$ variables, with high probability, any such algorithm requires $\Omega(\rho \log(m)/\epsilon^2)$ iterations to compute a $(1+\epsilon)$-approximate solution, where $\rho$ is the width of the input. The bound is tight for a range of the parameters $(m,n,\rho,\epsilon)$. The algorithms in the class include Dantzig-Wolfe decomposition, Benders' decomposition, Lagrangean relaxation as developed by Held and Karp [1971] for lower-bounding TSP, and many others (e.g. by Plotkin, Shmoys, and Tardos [1988] and Grigoriadis and Khachiyan [1996]). To prove the bound, we use a discrepancy argument to show an analogous lower bound on the support size of $(1+\epsilon)$-approximate mixed strategies for random two-player zero-sum 0/1-matrix games

Annual report African Studies Centre Leiden 2022

ASC – Publicaties niet-programma gebonde